package _01_动态数组;

public class _598_范围求和II {

    public int maxCount(int m, int n, int[][] ops) {
        // 求二维数组下标最小的
        int minRow = m;
        int minCol = n;
        for (int[] op : ops) {
            minRow = Math.min(minRow, op[0]);
            minCol = Math.min(minCol, op[1]);
        }

        return minRow * minCol;
    }

}
